Improvement of set-covering Weighted Control Model of S3PR
نویسندگان
چکیده
منابع مشابه
Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملA Critical-Siphon Approach to Fastest Deadlock Controller for S3PR
The authors developed a theory to show that exactly one monitor is required for the set of siphons in the family of 2-compound siphons and how to assign its initial markings. This avoids redundant monitors and the unnecessary associated computational burden. Neither reachability graph nor minimal siphon needs to be computed to achieve polynomial complexity—essential for large systems. This chap...
متن کاملLiveness of an extended S3PR
Most existing prevention methods tackle the deadlock issue arising in flexible manufacturing systems modeled with Petri nets by adding monitors and arcs. Instead, this paper presents a new one based on a characteristic structure of WS3PR, an extension of System of Simple Sequential Processes with Resources (S3PR) with weighted arcs. The numerical relationships among weights, and between weights...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملارائه یک الگوریتم ابتکاری جدید برای حل مساله مکان‌یابی پوشش کلی
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012